Euclidean $n$-space modulo an $(n-1)$-cell

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Multiplication Modulo (2^N-1)

This paper propose an efficient algorithm for multipliers modulo . To achieve high speed, the Wallace tree is adopted for the multipliers. The proposed Wallace tree multipliers exhibit much more resular structure than binary Wallace tree cultipliers. Comparison with a previous counterpart shows favorable to our multiplier in both speed and hardware..

متن کامل

BEST APPROXIMATION SETS IN -n-NORMED SPACE CORRESPONDING TO INTUITIONISTIC FUZZY n-NORMED LINEAR SPACE

The aim of this paper is to present the new and interesting notionof ascending family of  $alpha $−n-norms corresponding to an intuitionistic fuzzy nnormedlinear space. The notion of best aproximation sets in an  $alpha $−n-normedspace corresponding to an intuitionistic fuzzy n-normed linear space is alsodefined and several related results are obtained.

متن کامل

An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem

A randomizing algorithm for the weighted Euclidean 1-center problem is pre-xnted. The algorithm is shown to run on any problem in O (n log P I) time with high probability.

متن کامل

On the Isoptic Hypersurfaces in the n-Dimensional Euclidean Space

The theory of the isoptic curves is widely studied in the Euclidean plane E2 (see [1] and [13] and the references given there). The analogous question was investigated by the authors in the hyperbolic H2 and elliptic E2 planes (see [3], [4]), but in the higher dimensional spaces there is no result according to this topic. In this paper we give a natural extension of the notion of the isoptic cu...

متن کامل

Solving the Euclidean Steiner Tree Problem in n-space

We present a specialized branch-and-bound (b&b) algorithm for the Euclidean Steiner tree problem (ESTP) in R and apply it to a convex mixed-integer nonlinear programming (MINLP) formulation of the problem, presented by Fampa and Maculan. The algorithm contains procedures to avoid difficulties observed when applying a b&b algorithm for general MINLP problems to solve the ESTP. Our main emphasis ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1973

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1973-0324703-0